An adaptive quantum-inspired differential evolution algorithm for 0-1 knapsack problem
نویسندگان
چکیده
Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces. However, the design of its operators makes it unsuitable for many real-life constrained combinatorial optimization problems which operate on binary space. On the other hand, the quantum inspired evolutionary algorithm (QEA) is very well suitable for handling such problems by applying several quantum computing techniques such as Q-bit representation and rotation gate operator, etc. This paper extends the concept of differential operators with adaptive parameter control to the quantum paradigm and proposes the adaptive quantum-inspired differential evolution algorithm (AQDE). The performance of AQDE is found to be significantly superior as compared to QEA and a discrete version of DE on the standard 0-1 knapsack problem for all the considered test cases. Keywordsdifferential evolution; quantum inspired evolutionary algoithm; 0-1 knapsack problem; quantum computing
منابع مشابه
Quantum-Inspired Differential Evolution with Particle Swarm Optimization for Knapsack Problem
This paper presents a new hybrid algorithm called QDEPSO (Quantum inspired Differential Evolution with Particle Swarm Optimization) which combines differential evolution (DE), particle swarm optimization method (PSO) and quantum-inspired evolutionary algorithm (QEA) in order to solve the 0-1 optimization problems. In the initialization phase, the QDEPSO uses the concepts of quantum computing as...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملThe Multiple Knapsack Problem Approached by a Binary Differential Evolution Algorithm with Adaptive Parameters
In this paper the well-known 0-1 Multiple Knapsack Problem (MKP) is approached by an adaptive Binary Differential Evolution (aBDE) algorithm. The MKP is a NP-hard optimization problem and the aim is to maximize the total profit subjected to the total weight in each knapsack that must be less than or equal to a given limit. The aBDE self adjusts two parameters, perturbation and mutation rates, u...
متن کاملA Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem
Many problems in business and engineering can be modeled as 0-1 knapsack problems. However, the 0-1 knapsack problem is one of the classical NP-hard problems. Therefore, it is valuable to develop effective and efficient algorithms for solving 0-1 knapsack problems. Aiming at the drawbacks of the selection operator in the traditional differential evolution (DE), we present a novel discrete diffe...
متن کاملAn Effective Repair Procedure based on Quantum-inspired Evolutionary Algorithm for 0/1 Knapsack Problems
A new repair method based on QEA for 0/1 knapsack problems is proposed. In this approach, the qubit chromosome is used as heuristic knowledge to evaluate each element for the knapsack. The main idea is to delete the knapsack elements in the ascending order of qubit chromosome’s probability value whilst avoid violating the constraints on its capacity. To minimize the influence of initialization,...
متن کامل